The Access Problem and Knowledge of Logical Possibility
نویسنده
چکیده
Accepting truth-value realism can seem to raise an explanatory problem: what can explain our accuracy about mathematics, i.e., the match between human psychology and objective mathematical facts? A range of current truth-value realist philosophies of mathematics allow one to reduce this access problem to a problem of explaining our accuracy about which mathematical practices are coherent – in a sense which can be cashed out in terms of logical possibility. However, our ability to recognize these facts about logical possibility poses its own
منابع مشابه
A duality between LM-fuzzy possibility computations and their logical semantics
Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...
متن کاملExtending the Qualitative Trajectory Calculus Based on the Concept of Accessibility of Moving Objects in the Paths
Qualitative spatial representation and reasoning are among the important capabilities in intelligent geospatial information system development. Although a large contribution to the study of moving objects has been attributed to the quantitative use and analysis of data, such calculations are ineffective when there is little inaccurate data on position and geometry or when explicitly explaining ...
متن کاملIntuitive and logical way of thinking in the education of architectural design courses
Different approaches and methods are used in the architecture design process that logical and intuitional methods are the most common ones. The role of knowledge in each method is different. Investigating aspects of knowledge demonstrated the hierarchy from data to wisdom and the interaction of explicit and tacit types, subjective and objective sources, and analytical and exploratory ways of p...
متن کاملLogical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...
متن کامل